Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness

نویسندگان

  • Dmytro Korzhyk
  • Zhengyu Yin
  • Christopher Kiekintveld
  • Vincent Conitzer
  • Milind Tambe
چکیده

There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game model; for example, these games are at the heart of major applications such as the ARMOR program deployed for security at the LAX airport since 2007 and the IRIS program in use by the US Federal Air Marshals (FAMS). The foundational assumption for using Stackelberg games is that security forces (leaders), acting first, commit to a randomized strategy; while their adversaries (followers) choose their best response after surveillance of this randomized strategy. Yet, in many situations, the followers may act without observation of the leader’s strategy, essentially converting the game into a simultaneous-move game model. Previous work fails to address how a leader should compute her strategy given this fundamental uncertainty about the type of game faced. Focusing on the complex games that are directly inspired by real-world security applications, the paper provides four contributions in the context of a general class of security games. First, exploiting the structure of these security games, the paper shows that the Nash equilibria in security games are interchangeable, thus alleviating the equilibrium selection problem. Second, resolving the leader’s dilemma, it shows that under a natural restriction on security games, any Stackelberg strategy is also a Nash equilibrium strategy; and furthermore, the solution is unique in a class of security games of which ARMOR is a key exemplar. Third, when faced with a follower that can attack multiple targets, many of these properties no longer hold. Fourth, we show experimentally that in most (but not all) games where the restriction does not hold, the Stackelberg strategy is still a Nash equilibrium strategy, but this is no longer true when the attacker can attack multiple targets. These contributions have major implications for the real-world applications. As a possible direction for future research on cases where the Stackelberg strategy is not a Nash equilibrium strategy, we propose an extensive-form game model that makes the defender’s uncertainty about the attacker’s ability to observe explicit.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness

There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game model; for example, these games are at the heart of major applications such as the ARMOR program deployed for security at the LAX airport since 2007 and the IRIS program in use by the US Federal Air Marshals (FAMS). The f...

متن کامل

Catcher-Evader Games

Algorithms for computing game-theoretic solutions have recently been applied to a number of security domains. However, many of the techniques developed for compact representations of security games do not extend to Bayesian security games, which allow us to model uncertainty about the attacker’s type. In this paper, we introduce a general framework of catcher-evader games that can capture Bayes...

متن کامل

Pricing and Advertising Decisions in a Three-level Supply Chain with Nash, Stackelberg and Cooperative Games

Pricing and advertising are two important marketing strategies in the supply chain management which lead to customer demand’s increase and therefore higher profit for members of supply chains. This paper considers advertising, and pricing decisions simultaneously for a three-level supply chain with one supplier, one manufacturer and one retailer. The amount of market demand is influenced ...

متن کامل

Security Games with Multiple Attacker Resources

Algorithms for finding game-theoretic solutions are now used in several real-world security applications. This work has generally assumed a Stackelberg model where the defender commits to a mixed strategy first. In general two-player normal-form games, Stackelberg strategies are easier to compute than Nash equilibria, though it has recently been shown that in many security games, Stackelberg st...

متن کامل

Market power influential approach using game theory in a two competing supply chains with multi-echelons under centralized/decentralized environments

This paper is considering the competition between two multi-echelon supply-chains on price and service under balance and imbalance of market power between the chains which are analyzing through Nash and Stackelberg game approach. The problem is categorized as the centralized or decentralized structure of each chain, which means a few different possible scenarios are developing based on the Nash...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Artif. Intell. Res.

دوره 41  شماره 

صفحات  -

تاریخ انتشار 2011